|
Heuristic is an adjective used in relation to methods of learning, discovery, or problem solving. Routing is the process of selecting paths to specific destinations. According to Schuster (1974): Heuristic routing is a system used to describe how data is delivered when problems in a network topology arise. Heuristic routing is achieved using specific algorithms to determine the best, although not always optimal, path to a destination. When an interruption in a network topology occurs, the software running on the networking electronics calculates another route to the desired destination via an alternate available path. Heuristic routing is also used for vehicular traffic using the highway and transportation network of the world, but that is beyond the scope of this article. Heuristic routing: Routing in which data, such as time delay, extracted from incoming messages, during specified periods and over different routes, are used to determine the optimum routing for transmitting data back to the sources. Note: Heuristic routing allows a measure of route optimization based on recent empirical knowledge of the state of the network. ==IP routing== The routing protocols in use today are based on one of two algorithms: Distance Vector or Link State. Distance Vector algorithms broadcast routing information to all neighboring routers. Link State routing protocols build a topographical map of the entire network based on updates from neighbor routers, and then use the Dijkstra algorithm to compute the shortest path to each destination. Metrics used are based on the number of hops, delay, throughput, traffic, and reliability. Distance vector RIP uses number of hops, or gateways traversed, as its metric. IGRP uses bandwidth, delay, hop count, link reliability, load, and MTU. EIGRP uses the (DUAL) Diffusing Update Algorithm. BGP uses the Distance Vector algorithm Link state OSPF uses the Dijkstra algorithm. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「heuristic routing」の詳細全文を読む スポンサード リンク
|